Simplifying Nondeterministic Finite Cover Automata
نویسندگان
چکیده
منابع مشابه
Simplifying Nondeterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language, Nondeterministic Finite Automata (NFA) may significantly reduce the number of states used. The combined power of the succinctness of the representation of finite language...
متن کاملMore on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract
Finite languages are an important sub-regular language family, which were intensively studied during the last two decades in particular from a descriptional complexity perspective. An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite cover automata (DFCAs and NFCAs, respectively) as an alternative representation of...
متن کاملNondeterministic Finite Automata
This is an example of what is called a nondeterministic finite automaton (NFA). Intuitvely, such a machine could have many possible computations on a given input. For example, on an input of the form u001v, it is possible for the machine to reach the accepting state qp by transitioning from q to q0 after reading u. Similarly, it is possible for the machine to reach qp also on the input u01v — f...
متن کاملLearning Regular Languages Using Nondeterministic Finite Automata
A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge. The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task. A complete set of experiments has been carried out and the results of the new a...
متن کاملFinite nondeterministic automata: Simulation and minimality
Motivated by recent applications of finite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht–Fräısse-like games to model automata responses and simulations. The minimal automaton is constructed and, in contrast with the classical case, proved to be unique up to an isomorphism. Finally, we in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.151.11